An improved bound for the dimension of $(\alpha,2\alpha)$-Furstenberg sets
نویسندگان
چکیده
منابع مشابه
An Improved Bound for the Minkowski Dimension of Besicovitch Sets in Medium Dimension
We use geometrical combinatorics arguments, including the “hairbrush” argument of Wolff [11], the x-ray estimates in [12], [7], and the sticky/plany/grainy analysis of [6], to show that Besicovitch sets in Rn have Minkowski dimension at least n+2 2 + εn for all n ≥ 4, where εn > 0 is an absolute constant depending only on n. This complements the results of [6], which established the same result...
متن کاملAn improved lower bound related to the Furstenberg-Sárközy theorem
Let D(n) denote the cardinality of the largest subset of the set {1, 2, . . . , n} such that the difference of no pair of elements is a square. A well-known theorem of Furstenberg and Sárközy states that D(n) = o(n). In the other direction, Ruzsa has proven that D(n) & nγ for γ = 1 2 ( 1 + log 7 log 65 ) ≈ 0.733077. We improve this to γ = 1 2 ( 1 + log 12 log 205 ) ≈ 0.733412.
متن کاملAn Improved Bound for the Dimension of Sub eld
SUMMARY In this paper, we give a new lower bound for the dimension of subeld subcodes. This bound improves the lower bound given by Stichtenoth. A BCH code and a subeld subcode of algebraic geometric code on a hyper elliptic curve are discussed as special cases.
متن کاملAn improved bound on the Minkowski dimension of Besicovitch sets in R 3
A Besicovitch set is a set which contains a unit line segment in any direction. It is known that the Minkowski and Hausdorff dimensions of such a set must be greater than or equal to 5/2 in R3. In this paper we show that the Minkowski dimension must in fact be greater than 5/2 + ε for some absolute constant ε > 0. One observation arising from the argument is that Besicovitch sets of near-minima...
متن کاملSome Edge Cut Sets and an Upper bound for Edge Tenacity of Organic Compounds CnH2n+2
The graphs play an important role in our daily life. For example, the urban transport network can be represented by a graph, as the intersections are the vertices and the streets are the edges of the graph. Suppose that some edges of the graph are removed, the question arises, how damaged the graph is. There are some criteria for measuring the vulnerability of graph; the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Revista Matemática Iberoamericana
سال: 2021
ISSN: 0213-2230
DOI: 10.4171/rmi/1281